Eecient Testing for a Bitonic Column Property
نویسنده
چکیده
Bitonic columns are an extension of the consecutive ones property for a matrix. For some optimization problems, if the constraint matrix has the proper bitonic column property then a fast algorithm can nd an optimal solution. This paper shows how the PQ-tree reduction algorithm of Booth and Lueker can be extended into an eecient algorithm to test for a bitonic column property.
منابع مشابه
Design and Implementation of an Eecient Sorting Algorithm on Vector Multiprocessors
In this paper, we present the implementation of sorting algorithms based on bitonic mergers on vector multiprocessors. A programming methodology based on tensor products is used to design and implement these algorithms. We rst demonstrate this methodology by expressing Batcher's bitonic merger in a tensor product formulation. Using the algebraic theory of tensor products, several variations of ...
متن کاملGenerating Efficient Programs for Two-Level Memories from Tensor-products
This paper presents a framework for synthesizing eecient out-of-core programs for block recursive algorithms such as the fast Fourier transform (FFT) and Batcher's bitonic sort. The block recursive algorithms considered in this paper are described using tensor (Kronecker) product and other matrix operations. The algebraic properties of the matrix representation are used to derive eecient out-of...
متن کاملLayout of the Batcher Bitonic Sorter
The grid-area required by a sorting net for input vectors of length N is shown to be at least (N ? 1) 2 =2. Of all sorting nets which use o(N 2) comparators, the bitonic sorting net of Batcher has been known to have a layout of O(N 2), but the hidden constant factor has not been investigated. A straightforward use of known techniques leads to a layout of grid-area 20:25N 2. We present area-eeci...
متن کاملEstimation of Execution Time and Speedup for Bitonic Sorting in Sequential and Parallel Enviroment
The Batcher`s bitonic sorting algorithm is one of the best parallel sorting algorithms, for sorting random numbers in modern parallel machines. Load balancing property of bitonic sorting algorithm makes it unique among other parallel sorting algorithms. Contribution of bitonic sorting algorithm can be seen in various scientific and engineering applications. Research on a bitonic sorting algorit...
متن کاملVerifying Haskell programs by combining testing, model checking and interactive theorem proving
We propose a program verification method that combines random testing, model checking and interactive theorem proving. Testing and model checking are used for debugging programs and specifications before a costly interactive proof attempt. During proof development, testing and model checking quickly eliminate false conjectures and generate counterexamples which help to correct them. With an int...
متن کامل